The Uphill Battle of Ant Programming Vs. Genetic Programming
نویسندگان
چکیده
Ant programming has been proposed as an alternative to Genetic Programming (GP) for the automated production of computer programs. Generalized Ant Programming (GAP) – an automated programming technique derived from principles of swarm intelligence – has shown promise in solving symbolic regression and other hard problems. Enhanced Generalized Ant Programming (EGAP) has improved upon the performance of GAP; however, a comparison with GP has not been performed. This paper compares EGAP and GP on 3 well-known tasks: Quartic symbolic regression, multiplexer and an ant trail problem. When comparing EGAP and GP, GP is found to be statistically superior to EGAP. An analysis of the evolving program populations shows that EGAP suffers from premature diversity loss.
منابع مشابه
A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملA Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains
Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...
متن کاملAutomatic Generation of 2-AntWars Players with Genetic Programming
AntWars is a competitive two-player game with local information that was introduced as part of a competition accompanying the Genetic and Evolutionary Computation Conference 2007 [1,3]. Both players control an ant in a toroidal world and have to collect randomly placed pieces of food. The player who collects more food wins. 2-AntWars is an extension of AntWars. In 2-AntWars, each player control...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کامل